Sequentially Optimal Mechanisms

نویسنده

  • Vasiliki Skreta
چکیده

We characterize the revenue maximizing mechanism in a two-period model. A risk neutral seller owns one unit of a durable good and faces a risk neutral buyer whose valuation is private information. The seller has all the bargaining power; she designs an institution to sell the object at t=0 but she cannot commit not to change the institution at t=1 if trade does not occur at t=0. The seller’s objective is to pick the revenue maximizing mechanism. We show that if the probability density function of the buyer’s valuation satisfies certain conditions, the optimal mechanism is to post a price in each period. Previous work has examined price dynamics when the seller behaves sequentially rationally. We provide a reason for the seller’s choice to post a price even though she can use infinitely many other possible institutions: posted price selling is the optimal strategy in the sense that it maximizes the seller’s revenues.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Technical Appendix for "Sequentially Optimal Mechanisms"

This document contains a number of omitted proofs and a more "formal" proof of the main theorem of the paper "Sequentially Optimal Mechanisms." 1. Omitted and Detailed Proofs for the Case that T = 2 Proof of Proposition 2 Step 1 We start by proving existence of the solution of the seller’s problem when T = 1. The seller seeks to solve

متن کامل

Extensions on "Sequentially Optimal Mechanisms"

This document establishes that the result in "Sequentially Optimal Mechanisms" is robust to a number of extensions. 1. Robustness: Longer Horizon & Alternative Degrees of Transparency We will show that our result is robust in a number of di¤erent directions. The …rst extension considers the possibility that the game lasts arbitrarily long, but …nitely many periods. The next three extensions are...

متن کامل

Optimal strategies in sequential bidding

We are interested in mechanisms that maximize social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the class of feasible and incentive compatible mechanisms were identified. One way to improve upon these optimality results is by allowing the players to move s...

متن کامل

Sequential implementation without commitment

In a finite-horizon intertemporal setting, in which society needs to decide and enforce a socially optimal outcome in each period without being able to commit to future ones, the paper examines problems of implementing dynamic social choice processes. A dynamic social choice process is a social choice function (SCF) that maps every admissible state into a socially optimal outcome on the basis o...

متن کامل

Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry

We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...

متن کامل

Optimal Strategies in Sequential Bidding ( Extended

We are interested in mechanisms that maximize the final social welfare. In [1] this problem was studied for multiunit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the class of feasible and incentive compatible mechanisms were identified. One way to improve upon these optimality results is by relaxing the assumpti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000